Explicit Construction of Small Folkman Graphs
نویسنده
چکیده
A Folkman graph is a K4-free graph G such that if the edges of G are 2-colored, then there exists a monochromatic triangle. Erdős offered a prize for proving the existence of a Folkman graph with at most 1 million vertices. In this paper, we construct several “small” Folkman graphs within this limit. In particular, there exists a Folkman graph on 9697 vertices.
منابع مشابه
Some recent results on Ramsey-type numbers
In this paper we survey author’s recent results on quantitative extensions of Ramsey theory. In particular, we discuss our recent results on Folkman numbers, induced bipartite Ramsey graphs, and explicit constructions of Ramsey graphs.
متن کاملSemisymmetry of Generalized Folkman Graphs
A regular edge but not vertex transitive graph is said to be semisym metric The study of semisymmetric graphs was initiated by Folkman who among others gave constructions of several in nite families such graphs In this paper a generalization of his construction for or ders a multiple of is proposed giving rise to some new families of semisymmetric graphs In particular one associated with the cy...
متن کاملChromatic Vertex Folkman Numbers
For graph G and integers a1 ≥ · · · ≥ ar ≥ 2, we write G → (a1, · · · , ar) if and only if for every r-coloring of the vertex set V (G) there exists a monochromatic Kai in G for some color i ∈ {1, · · · , r}. The vertex Folkman number Fv(a1, · · · , ar; s) is defined as the smallest integer n for which there exists a Ks-free graph G of order n such that G→ (a1, · · · , ar). It is well known tha...
متن کاملOn Construction of Almost-Ramanujan Graphs
Reingold et al. introduced the notion zig-zag product on two different graphs, and presented a fully explicit construction of dregular expanders with the second largest eigenvalue O(d−1/3). In the same paper, they ask whether or not the similar technique can be used to construct expanders with the second largest eigenvalue O(d−1/2). Such graphs are called Ramanujan graphs. Recently, zig-zag pro...
متن کاملUse of MAX-CUT for Ramsey Arrowing of Triangles
In 1967, Erdős and Hajnal asked the question: Does there exist a K4-free graph that is not the union of two triangle-free graphs? Finding such a graph involves solving a special case of the classical Ramsey arrowing operation. Folkman proved the existence of these graphs in 1970, and they are now called Folkman graphs. Erdős offered $100 for deciding if one exists with less than 10 vertices. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 21 شماره
صفحات -
تاریخ انتشار 2008